منابع مشابه
Quantum algorithms for shifted subset problems
We consider a recently proposed generalisation of the abelian hidden subgroup problem: the shifted subset problem. The problem is to determine a subset S of some abelian group, given access to quantum states of the form |S + x〉, for some unknown shift x. We give quantum algorithms to find Hamming spheres and other subsets of the boolean cube {0, 1}n. The algorithms have time complexity polynomi...
متن کاملQuantum Algorithms for the Subset-Sum Problem
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham–Joux subset-sum algorithm with a new streamlined data structure for quantum walks on Johnson graphs.
متن کاملClaw finding algorithms using quantum walk
The claw finding problem has been studied in terms of query complexity as one of the problems closely connected to cryptography. For given two functions, f and g, as an oracle which have domains of size N and M (N ≤ M), respectively, and the same range, the goal of the problem is to find x and y such that f (x) = g(y). This problem has been considered in both quantum and classical settings in t...
متن کاملImproved quantum query algorithms for triangle finding and associativity testing
We show that the quantum query complexity of detecting if an n-vertex graph contains a triangle is O(n). This improves the previous best algorithm of Belovs [2] making O(n) queries. For the problem of determining if an operation ◦ : S × S → S is associative, we give an algorithm making O(|S|) queries, the first improvement to the trivial O(|S|) application of Grover search. Our algorithms are d...
متن کاملQuantum Algorithms for Finding Constant-Sized Sub-hypergraphs
Quantum query complexity is a model of quantum computation, in which the cost of computing a function is measured by the number of queries that are made to the input given as a black-box. In this model, it was exhibited in the early stage of quantum computing research that there exist quantum algorithms superior to the classical counterparts, such as Deutsch and Jozsa’s algorithm, Simon and Sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2005
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic5.7-7